A Convex Maximization Problem: Continuous Case
نویسنده
چکیده
We study a specific convex maximization problem in the space of continuous functions defined on a semi-infinite interval. An unexplained connection to the discrete version of this problem is investigated.
منابع مشابه
Portfolio optimization under convex incentive schemes
We consider the terminal wealth utility maximization problem from the point of view of a portfolio manager who is paid by an incentive scheme, which is given as a convex function g of the terminal wealth. The manager’s own utility function U is assumed to be smooth and strictly concave, however the resulting utility function U ◦ g fails to be concave. As a consequence, the problem considered he...
متن کاملWell-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
Problems of best tensor product approximation of low orthogonal rank can be formulated as maximization problems on Stiefel manifolds. The functionals that appear are convex and weakly sequentially continuous. It is shown that such problems are always well-posed, even in the case of non-compact Stiefel manifolds. As a consequence, problems of finding a best orthogonal, strong orthogonal or compl...
متن کاملConditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap
In this paper, we study the problem of constrained and stochastic continuous submodular maximization. Even though the objective function is not concave (nor convex) and is defined in terms of an expectation, we develop a variant of the conditional gradient method, called Stochastic Continuous Greedy, which achieves a tight approximation guarantee. More precisely, for a monotone and continuous D...
متن کاملOn the monotonization of the training set
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is NPhard in general and is equivalent to finding a maximal independent set in special orgraphs. Practically important cases of that problem considered in detail. ...
متن کاملNon-monotone Continuous DR-submodular Maximization: Structure and Algorithms
DR-submodular continuous functions are important objectives with wide real-world applications spanning MAP inference in determinantal point processes (DPPs), and mean-field inference for probabilistic submodular models, amongst others. DR-submodularity captures a subclass of non-convex functions that enables both exact minimization and approximate maximization in polynomial time. In this work w...
متن کامل